Telescopic mappings in typed lambda calculus
نویسندگان
چکیده
منابع مشابه
Telescopic Mappings in Typed Lambda Calculus
1.1. Lambda calculus is not intended to be just a formal game: it was created with the intent to represent operations with functions in mathematics. This had become necessary ever since the time (in the first half of the 19th century) that mathematicians began to see functions as objects, rather than as constructions in the metalanguage. As we see it today, lambda calculus is indispensable in t...
متن کامل2 Dynamically typed lambda calculus
We present an extension of a statically typed language with a special type Dynamic and explicit type tagging and checking operations (coercions). Programs in run-time typed languages are viewed as incomplete programs that are to be completed to well-typed programs by explicitly inserting coercions into them. Such completions are generally not unique. If the meaning of an incomplete program is t...
متن کاملConstructive Data Reenement in Typed Lambda Calculus
A new treatment of data reenement in typed lambda calculus is proposed, based on pre-logical relations HS99] rather than logical relations as in Ten94], and incorporating a constructive element. Constructive data reenement is shown to have desirable properties, and a substantial example of reenement is presented.
متن کاملRecognizability in the Simply Typed Lambda-Calculus
We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite models. Using intersection types, we generalize the notions of automata for strings and trees so as to grasp recognizability for λ-terms. We then expose the closure properties of this notion and present some of its applications.
متن کاملConstructive Data Refinement in Typed Lambda Calculus
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90066-b